Some Formulas for the Principal Matrix pth Root

نویسندگان

  • R. Ben Taher
  • M. Rachidi
چکیده

In this paper we project to develop two methods for computing the principal matrix pth root. Our approach makes use of the notion of primary matrix functions and minimal polynomial. Therefore, compact formulas for the principal matrix pth root are established and significant cases are explored. Mathematics Subject Classification: Primary 15A24, 15A99, 65H10 Secondary 15A18

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A STABLE COUPLED NEWTON'S ITERATION FOR THE MATRIX INVERSE $P$-TH ROOT

The computation of the inverse roots of matrices arises in evaluating non-symmetriceigenvalue problems, solving nonlinear matrix equations, computing some matrixfunctions, control theory and several other areas of applications. It is possible toapproximate the matrix inverse pth roots by exploiting a specialized version of New-ton's method, but previous researchers have mentioned that some iter...

متن کامل

On the Newton Method for the Matrix P th Root

We consider the Newton iteration for computing the principal matrix pth root, which is rarely used in the application for the bad convergence and the poor stability. We analyze the convergence conditions. In particular it is proved that the method converges for any matrix A having eigenvalues with modulus less than 1 and with positive real part. Based on these results we provide a general algor...

متن کامل

On Newton’s method and Halley’s method for the principal pth root of a matrix

If A is a matrix with no negative real eigenvalues and all zero eigenvalues of A are semisimple, the principal pth root of A can be computed by Newton’s method or Halley’s method, with a preprocessing procedure if necessary. We prove a new convergence result for Newton’s method, and discover an interesting property of Newton’s method and Halley’s method in terms of series expansions. We explain...

متن کامل

A Family of Rational Iterations and Its Application to the Computation of the Matrix pth Root

Matrix fixed-point iterations zn+1 = ψ(zn) defined by a rational function ψ are considered. For these iterations a new proof is given that matrix convergence is essentially reduced to scalar convergence. It is shown that the principal Padé family of iterations for the matrix sign function and the matrix square root is a special case of a family of rational iterations due to Ernst Schröder. This...

متن کامل

On pth roots of stochastic matrices

In Markov chain models in finance and healthcare a transition matrix over a certain time interval is needed but only a transition matrix over a longer time interval may be available. The problem arises of determining a stochastic pth root of a stochastic matrix (the given transition matrix). By exploiting the theory of functions of matrices, we develop results on the existence and characterizat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014